On the Complexity of Isomorphism Problems Related to Polytopes
نویسندگان
چکیده
We show that the problem to decide whether two (convex) polytopes are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the polytope isomorphism problem in bounded dimension, which is based on Luks’ algorithm for the isomorphism problem of graphs of bounded maximal degree.
منابع مشابه
On the Complexity of Polytope Isomorphism Problems
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the combinatorial polytope isomorphism problem in bounded dimensions. Furthermore, we derive that the problems to decide whether...
متن کاملComplexity of Some Polyhedral Enumeration Problems
In this thesis we consider the problem of converting the halfspace representation of a polytope to its vertex representation — the Vertex Enumeration problem — and various other basic and closely related computational problems about polytopes. The problem of converting the vertex representation to halfspace representation — the Convex Hull problem — is equivalent to vertex enumeration. In chapt...
متن کاملAffine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
We consider two polytopes. The quadratic assignment polytope QAP(n) is the convex hull of the set of tensors x⊗x, x ∈ Pn, where Pn is the set of n×n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider appropriate (n 2 ) × (n 2 ) permutation matrix of the edges of Kn. The Young polytope P ((n − 2, 2)) is the conv...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملA Family of Counter Examples to an Approach to Graph Isomorphism
We give a family of counter examples showing that the two sequences of polytopes Φn,n and Ψn,n are different. These polytopes were defined recently by S. Friedland in an attempt at a polynomial time algorithm for graph isomorphism.
متن کامل